On the total domination number of cross products of graphs
نویسندگان
چکیده
منابع مشابه
On the total domination number of cross products of graphs
We give lower and upper bounds on the total domination number of the cross product of two graphs, t (G×H). These bounds are in terms of the total domination number and the maximum degree of the factors and are best possible. We further investigate cross products involving paths and cycles.We determine the exact values of t (G×Pn) and t (Cn×Cm)where Pn and Cn denote, respectively, a path and a c...
متن کاملOn the Total Domination Number of Cartesian Products of Graphs
Let γ {k} t (G) denote the total {k}-domination number of graph G, and let G H denote the Cartesian product of graphs G and H . In this paper, we show that for any graphs G and H without isolated vertices, γ {k} t (G)γ {k} t (H) ≤ k(k + 1)γ {k} t (G H). As a corollary of this result, we have γt (G)γt (H) ≤ 2γt (G H) for all graphs G and H without isolated vertices, which is given by Pak Tung Ho...
متن کاملOn the super domination number of graphs
The open neighborhood of a vertex $v$ of a graph $G$ is the set $N(v)$ consisting of all vertices adjacent to $v$ in $G$. For $Dsubseteq V(G)$, we define $overline{D}=V(G)setminus D$. A set $Dsubseteq V(G)$ is called a super dominating set of $G$ if for every vertex $uin overline{D}$, there exists $vin D$ such that $N(v)cap overline{D}={u}$. The super domination number of $G$ is the minimum car...
متن کاملTotal Roman domination subdivision number in graphs
A {em Roman dominating function} on a graph $G$ is a function $f:V(G)rightarrow {0,1,2}$ satisfying the condition that every vertex $u$ for which $f(u)=0$ is adjacent to at least one vertex $v$ for which $f(v)=2$. A {em total Roman dominating function} is a Roman dominating function with the additional property that the subgraph of $G$ induced by the set of all vertices of positive weight has n...
متن کاملTotal domination of Cartesian products of graphs
Let γt(G) and γpr(G) denote the total domination and the paired domination numbers of graph G, respectively, and let G ¤ H denote the Cartesian product of graphs G and H. In this paper, we show that γt(G)γt(H) ≤ 5γt(G ¤ H), which improves the known result γt(G)γt(H) ≤ 6γt(G ¤ H) given by Henning and Rall.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2008
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.04.034